Technical Report 2012-596 Nondeterministic State Complexity and Quantifying Non-Determinism in Finite Automata
نویسنده
چکیده
منابع مشابه
Technical Report No. 2010-567 State Complexity of Unranked Tree Automata
We consider the representational state complexity of unranked tree automata. The bottomup computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic defi...
متن کاملForms of Determinism for Automata∗
We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost f...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملQuantifying Nondeterminism in Finite Automata
Various ways of quantifying the nondeterminism in finite automata have been considered since the 1970’s. Roughly speaking, a nondeterminism measure can count the number of accepting computations (ambiguity), the number of all computations (computation width) or the amount of nondeterminism on a single best (or worst) computation on a given input. This paper surveys results on the growth rate of...
متن کاملTwo-way non-deterministic finite automata with a write-once track recognize regular languages only
The basic finite automata model has been extended over the years with different acceptance modes (non-determinism, alternation), new or improved devices (two-way heads, pebbles, nested pebbles) or with cooperation. None of these additions permits recognition of non-regular languages. The purpose of this work is to investigate a new extension which is inspired by an extension of 2DPDAs. Mogensen...
متن کامل